The 3-Good-Neighbor Connectivity of Modified Bubble-Sort Graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault-tolerant maximal local-connectivity on Bubble-sort star graphs

An interconnection network is usually modeled as a graph, in which vertices and edges correspond to processor and communication links, respectively. Connectivity is an important measurement for the fault tolerant in interconnection network. Two vertices is maximally local-connected if the maximum number of internally vertex-disjoint paths between them equals the minimum degree of these two vert...

متن کامل

Automorphism group of the modified bubble-sort graph

The modified bubble-sort graph of dimension n is the Cayley graph of Sn generated by n cyclically adjacent transpositions. In the present paper, it is shown that the automorphism group of the modified bubble sort graph of dimension n is Sn×D2n, for all n ≥ 5. Thus, a complete structural description of the automorphism group of the modified bubble-sort graph is obtained. A similar direct product...

متن کامل

Matching preclusion for the (n, k)-bubble-sort graphs

Eddie Cheng, László Lipták, Oakland University and David Sherman∗, Groves High School The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. We find this number for the (n, k)-bubble-sort graphs and classify all the optimal solutions.

متن کامل

The Tightly Super 2-good-neighbor connectivity and 2-good-neighbor Diagnosability of Crossed Cubes

Mass data processing and complex problem solving have higher and higher demands for performance of multiprocessor systems. Many multiprocessor systems have interconnection networks (networks for short) as underlying topologies and a network is usually represented by a graph where nodes represent processors and links represent communication links between processors. The network determines the pe...

متن کامل

Run Time Bubble Sort – An Enhancement of Bubble Sort

In many real applications, sorting plays an important role as it makes easy to handle the data by arranging it in ascending or descending order, according to requirements. Bubble sort is most common sorting algorithm, but not efficient for many applications. There are number of other sorting algorithms and still, research is going for new sorting algorithms to improve the complexities of existi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2020

ISSN: 1563-5147,1024-123X

DOI: 10.1155/2020/7845987